Computational Depth

نویسندگان

  • Luis Filipe Coelho Antunes
  • Lance Fortnow
  • Dieter van Melkebeek
چکیده

We introduce Computational Depth, a measure for the amount of “nonrandom” or “useful” information in a string by considering the difference of various Kolmogorov complexity measures. We investigate three instantiations of Computational Depth: Basic Computational Depth, a clean notion capturing the spirit of Bennett’s Logical Depth. Time-t Computational Depth and the resulting concept of Shallow Sets, a generalization of sparse and random sets based on low depth properties of their characteristic sequences. We show that every computable set that is reducible to a shallow set has polynomial-size circuits. Distinguishing Computational Depth, measuring when strings are easier to recognize than to produce. We show that if a Boolean formula has a nonnegligible fraction of its satisfying assignments with low depth, then we can find a satisfying assignment efficiently. Research done while visiting the Center for Discrete Mathematics and Computer Science (DIMACS). Supported in part by DIMACS and Fundação Calouste Gulbenkian. This author is also partially supported by funds granted to LIACC through the Programa de Financiamento Plurianual, Fundação para a Ciência e Tecnologia and Programa POSI. Address: Artificial Intelligence and Computer Science Laboratory, R.Campo Alegre, 823, 4150-180 Porto, Portugal. Email: [email protected]. Web: http://www.ncc.up.pt/ ̃lfa. yAddress: 4 Independence Way, Princeton, NJ 08540 Email: [email protected]. Web: http://www.neci.nj.nec.com/homepages/fortnow. zAddress: School of Mathematics, Institute for Advanced Study, Einstein Drive, Princeton, NJ 08540. Email: [email protected]. Web: http://www.math.ias.edu/ ̃dieter. Torturing an uninformed witness cannot give information about the crime. Leonid Levin [10]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Intra Mode Decision for Depth Map coding in 3D-HEVC Standard

three dimensional- high efficiency video coding (3D-HEVC) is the expanded version of the latest video compression standard, namely high efficiency video coding (HEVC), which is used to compress 3D videos. 3D videos include texture video and depth map. Since the statistical characteristics of depth maps are different from those of texture videos, new tools have been added to the HEVC standard fo...

متن کامل

Computational Models for Multiview Dense Depth Maps of Dynamic Scene

This paper reviews the recent progresses of the depth map generation for dynamic scene and its corresponding computational models. This paper mainly covers the homogeneous ambiguity models in depth sensing, resolution models in depth processing, and consistency models in depth optimization. We also summarize the future work in the depth map generation.

متن کامل

Improved Content Aware Image Retargeting Using Strip Partitioning

Based on rapid upsurge in the demand and usage of electronic media devices such as tablets, smart phones, laptops, personal computers, etc. and its different display specifications including the size and shapes, image retargeting became one of the key components of communication technology and internet. The existing techniques in image resizing cannot save the most valuable information of image...

متن کامل

Exactly computing bivariate projection depth contours and median

Among their competitors, projection depth and its induced estimators are very favorable because they can enjoy very high breakdown point robustness without having to pay the price of low e ciency, meanwhile providing a promising centeroutward ordering of multi-dimensional data. However, their further applications have been severely hindered due to their computational challenge in practice. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001